Finding hidden Borel subgroups of the general linear group
نویسندگان
چکیده
منابع مشابه
Prehomogeneous spaces for Borel subgroups of general linear groups
Let k be an algebraically closed field. Let B be the Borel subgroup of GLn(k) consisting of nonsingular upper triangular matrices. Let b = LieB be the Lie algebra of upper triangular n × n matrices and u the Lie subalgebra of b consisting of strictly upper triangular matrices. We classify all Lie ideals n of b, satisfying u ⊆ n ⊆ u, such that B acts (by conjugation) on n with a dense orbit. Fur...
متن کاملConjugacy of Subgroups of the General Linear Group
In this paper we present a new, practical algorithm for solving the subgroup conjugacy problem in the general linear group. Mathematics Subject Classification: 20-04, 20H30. 1 Introductory Material This paper presents a new algorithm to solve a subcase of the following: Problem. Given two groups G,H ≤ K, determine whether there exists a k ∈ K such that G = H. If so, return one such k. This prob...
متن کاملBorel Subgroups of Polish Groups
We study three classes of subgroups of Polish groups: Borel subgroups, Polishable subgroups, and maximal divisible subgroups. The membership of a subgroup in each of these classes allows one to assign to it a rank, that is, a countable ordinal, measuring in a natural way complexity of the subgroup. We prove theorems comparing these three ranks and construct subgroups with prescribed ranks. In p...
متن کاملOn the norm of the derived subgroups of all subgroups of a finite group
In this paper, we give a complete proof of Theorem 4.1(ii) and a new elementary proof of Theorem 4.1(i) in [Li and Shen, On the intersection of the normalizers of the derived subgroups of all subgroups of a finite group, J. Algebra, 323 (2010) 1349--1357]. In addition, we also give a generalization of Baer's Theorem.
متن کاملFinding hidden cliques in linear time
In the hidden clique problem, one needs to find the maximum clique in an n-vertex graph that has a clique of size k but is otherwise random. An algorithm of Alon, Krivelevich and Sudakov that is based on spectral techniques is known to solve this problem (with high probability over the random choice of input graph) when k ≥ c √ n for a sufficiently large constant c. In this manuscript we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2012
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic12.7-8-10